An amortized-complexity method to compute the Riemann zeta function
نویسنده
چکیده
A practical method to compute the Riemann zeta function is presented. The method can compute ζ(1/2 + it) at any T 1/4 points in [T, T + T 1/4] using an average time of T 1/4+o(1) per point. This is the same complexity as the Odlyzko-Schönhage algorithm over that interval. Although the method far from competes with the Odlyzko-Schönhage algorithm over intervals much longer than T 1/4, it still has the advantages of being elementary, simple to implement, it does not use the fast Fourier transform or require large amounts of storage space, and its error terms are easy to control. The method has been implemented, and results of timing experiments agree with its theoretical amortized complexity of T 1/4+o(1).
منابع مشابه
Fast methods to compute the Riemann zeta function
The Riemann zeta function on the critical line can be computed using a straightforward application of the Riemann-Siegel formula, Schönhage’s method, or Heath-Brown’s method. The complexities of these methods have exponents 1/2, 3/8 (=0.375), and 1/3 respectively. In this paper, three new fast and potentially practical methods to compute zeta are presented. One method is very simple. Its comple...
متن کاملA more accurate half-discrete Hardy-Hilbert-type inequality with the best possible constant factor related to the extended Riemann-Zeta function
By the method of weight coefficients, techniques of real analysis and Hermite-Hadamard's inequality, a half-discrete Hardy-Hilbert-type inequality related to the kernel of the hyperbolic cosecant function with the best possible constant factor expressed in terms of the extended Riemann-zeta function is proved. The more accurate equivalent forms, the operator expressions with the norm, the rever...
متن کاملA multimodular algorithm for computing Bernoulli numbers
We describe an algorithm for computing Bernoulli numbers. Using a parallel implementation, we have computed Bk for k = 10 8, a new record. Our method is to compute Bk modulo p for many small primes p, and then reconstruct Bk via the Chinese Remainder Theorem. The asymptotic time complexity is O(k2 log k), matching that of existing algorithms that exploit the relationship between Bk and the Riem...
متن کاملA Discrete Mean Value of the Derivative of the Riemann Zeta Function
In this article we compute a discrete mean value of the derivative of the Riemann zeta function. This mean value will be important for several applications concerning the size of ζ(ρ) where ζ(s) is the Riemann zeta function and ρ is a non-trivial zero of the Riemann zeta function.
متن کاملGaps between consecutive zeros of the Riemann zeta-function
An important problem in number theory is to study the distribution of the non-trivial zeros of the Riemann zeta-function which, if one is willing to assume the Riemann Hypothesis, all lie on a vertical line. It is relatively easy to count how many of these zeros lie in a large interval, so the average spacing between consecutive zeros is easy to compute. However, it is a difficult and interesti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 80 شماره
صفحات -
تاریخ انتشار 2011